Error-Correcting Factorization

نویسندگان

  • Miguel Ángel Bautista
  • Oriol Pujol
  • Fernando De la Torre
  • Sergio Escalera
چکیده

Error Correcting Output Codes (ECOC) is a successful technique in multi-class classification, which is a core problem in Pattern Recognition and Machine Learning. A major advantage of ECOC over other methods is that the multi-class problem is decoupled into a set of binary problems that are solved independently. However, literature defines a general error-correcting capability for ECOCs without analyzing how it distributes among classes, hindering a deeper analysis of pairwise error-correction. To address these limitations this paper proposes an Error-Correcting Factorization (ECF) method. Our contribution is three fold: (I) We propose a novel representation of the error-correction capability, called the design matrix, that enables us to build an ECOC on the basis of allocating correction to pairs of classes. (II) We derive the optimal code length of an ECOC using rank properties of the design matrix. (III) ECF is formulated as a discrete optimization problem, and a relaxed solution is found using an efficient constrained block coordinate descent approach. (IV) Enabled by the flexibility introduced with the design matrix we propose to allocate the error-correction on classes that are prone to confusion. Experimental results in several databases show that when allocating the error-correction to confusable classes ECF outperforms state-of-the-art approaches.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correcting Errors in RSA Private Keys

Let pk = (N , e) be an RSA public key with corresponding secret key sk = (p, q , d , dp , dq , q −1 p ). Assume that we obtain partial error-free information of sk, e.g., assume that we obtain half of the most significant bits of p. Then there are well-known algorithms to recover the full secret key. As opposed to these algorithms that allow for correcting erasures of the key sk, we present for...

متن کامل

Cyclic Quantum Error-Correcting Codes and Quantum Shift Registers

Quantum error-correction will be an essential building-block for the physical implementation of a quantum computer since it is unlikely that the coherence time of a quantum mechanical system is long enough to perform any computation of interest, such as factoring large numbers (see ?). The last years have seen a great progress in the theory of quantum error-correcting codes (see, e.g., ?; ?). T...

متن کامل

Naive Mean Field Approximation for the Error Correcting Code

Solving the error correcting code is an important goal with regard to communication theory. To reveal the error correcting code characteristics, several researchers have applied a statistical-mechanical approach to this problem. In our research, we have treated the error correcting code as a Bayes inference framework. Carrying out the inference in practice, we have applied the NMF (naive mean f...

متن کامل

Quantum Reed-Solomon Codes

During the last years it has been shown that computers taking advantage of quantum mechanical phenomena outperform currently used computers. The striking examples are integer factoring in polynomial time (see [8]) and finding pre– images of an n–ary Boolean function (“searching”) in time O( √ 2n) (see [5]). Quantum computers are not only of theoretical nature—there are several suggestions how t...

متن کامل

Cyclic Quantum Error-Correcting Codes and Quantum Shift Registers

Quantum error-correction will be an essential building-block for the physical implementation of a quantum computer since it is unlikely that the coherence time of a quantum mechanical system is long enough to perform any computation of interest, such as factoring large numbers (see Shor 1994). The last years have seen a great progress in the theory of quantum error-correcting codes (see, e.g., ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE transactions on pattern analysis and machine intelligence

دوره   شماره 

صفحات  -

تاریخ انتشار 2017